On Testing Expansion in Bounded-Degree Graphs Oded Goldreich and Dana Ron Abstract. We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the

Source URL: www.wisdom.weizmann.ac.il

Algorithmic and Analysis Techniques in Property Testing Dana Ron∗ School of EE Tel-Aviv University Ramat Aviv, Israel

Source URL: www.eng.tau.ac.il

The GoDeL Planning System: A More Perfect Union of Domain-Independent and Hierarchical Planning Vikas Shivashankar1 Ron Alford1 Ugur Kuter2 Dana Nau1

Source URL: www.cs.umd.edu

• Philosophy
• American philosophers
• Automated planning and scheduling
• Hierarchical task network
• Partial-order planning
• Kurt Gdel
• Logic programming
• Godel

Property Testing: A Learning Theory Perspective Dana Ron∗ School of EE Tel-Aviv University Ramat Aviv, Israel

Source URL: www.eng.tau.ac.il

• Machine learning
• Computational complexity theory
• Theoretical computer science
• Applied mathematics
• Learning
• Models of computation
• Property testing
• Decision tree model
• Sample complexity
• PP
• Probability distribution
• Time complexity

Testing Properties of Collections of Distributions Reut Levi∗ Dana Ron † Ronitt Rubinfeld‡

Source URL: www.eng.tau.ac.il

Repeating Jansky’s Experiment NRAO - Green Bank, With ringleaders : Darrel Emerson, Sue Ann Heatherly, Frank Ghigo , Glen Langston, Ron Maddalena, Dana Balser

Source URL: www.gb.nrao.edu

Testing Monotonicity Oded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron, Alex Samorodnitsky Presented by Shlomo Jozeph

Source URL: www.wisdom.weizmann.ac.il

Property Testing: A Learning Theory Perspective Dana Ron∗ School of EE Tel-Aviv University Ramat Aviv, Israel

Source URL: www.eng.tau.ac.il

Plan Aggregation for Strong Cyclic Planning in Nondeterministic Domains Ron Alforda , Ugur Kuterc , Dana Naub , Robert P. Goldmanc a ASEE/NRL Postdoctoral Fellow 4555 Overlook Ave., SW Washington, DCb Department

Source URL: rpgoldman.goldman-tribe.org

• Computational complexity theory
• Automated planning and scheduling
• S0
• NP

Bibliography [1] W. Aiello, M. Bellare and R. Venkatesan. Knowledge on the Average { Perfect, Statistical and Logarithmic. In 27th ACM Symposium on the Theory of Computing, pages 469{478, [removed]W. Aiello and J. Hast

Source URL: www.wisdom.weizmann.ac.il

• Computer science
• ACM SIGACT
• Mathematical sciences
• International Colloquium on Automata
• Languages and Programming
• Cryptography
• Dana Ron
• Sheila Greibach
• Applied mathematics
• Silvio Micali
• Theoretical computer science